Synthesizing Non-Uniform Systolic Designs
نویسندگان
چکیده
In this paper we propose a method to derive systolic designs with non-uniform data flow. One of the major difficulties in systematic design is in transforming the original sequential specification of a problem into a Conn suitable [0 VLSI implementation. Our approach [Q auromatically restructuring a problem is based on a subset of me data dependencies eXITacted from the original problem specification. By using such dependencies we are able to identify chains of dependem computations which are then convened into recurrence equations. The mapping of the new specification imo hardware is also based on data dependencies. We illusrrate the methodology by applying it [0 algorithms using dynamic programming.
منابع مشابه
Space-Time Equations for Non-Unimodular Mappings
Abstract. The class of systems of uniform recurrence equations (UREs) is closed under unimodular transformations. As a result, every systolic array described by a unimodular mapping can be specified by a system of space-time UREs, in which the time and space coordinates are made explicit. As non-unimodular mappings are frequently used in systolic designs, this paper presents a method that deriv...
متن کاملOptimal Design of Lower Dimensional Processor Arrays for Uniform Recurrencesy
In this paper we present a parameter-based approach for synthesizing systolic architectures from uniform recurrence equations. The scheme presented is a generalization of the Parameter Method proposed by Li and Wah 1]. The approach synthesizes optimal arrays of any lower dimension from a general uniform recurrence description of the problem. In other previous attempts for mapping uniform recurr...
متن کاملSynthesizing Optimal Lower Dimensional Processor Arrays y
Most existing methods for synthesizing systolic architectures can only map n-dimensional recurrences to n 1-dimensional arrays. In this paper, we generalize the parameter-based approach of Li and Wah [1] to map n-dimensional uniform recurrences to any k-dimensional processor arrays, where k < n. In our approach, operations of the target array are captured by a set of parameters, and constraints...
متن کاملMicrosoft Word - 79-46-50
In this paper one optimization heuristic search technique, Hybrid Evolutionary Programming (HEP) is applied to the process of synthesizing three-ring Concentric Circular Antenna Array (CCAA) focused on maximum sidelobe-level reduction. This paper assumes non-uniform excitations and uniform spacing of excitation elements in each three-ring CCAA design. Experimental results reveal that the design...
متن کاملConverting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations
Most work on the problem of synthesizing a systolic array from a system of recurrence equations is restricted to systems of uniform recurrence equations. Recently, researchers have begun to relax this restriction to include systems of affine recurrence equations. A system of uniform recurrence equations typically can be embedded in spacetime so that the distance between a variable and a depende...
متن کامل